An ~O(n) Queries Adaptive Tester for Unateness
نویسندگان
چکیده
We present an adaptive tester for the unateness property of Boolean functions. Given a function f : {0, 1}n → {0, 1} the tester makes O(n log(n)/ε) adaptive queries to the function. The tester always accepts a unate function, and rejects with probability at least 0.9 if a function is ε-far from being unate.
منابع مشابه
An $\widetilde{O}(n)$ Queries Adaptive Tester for Unateness
We present an adaptive tester for the unateness property of Boolean functions. Given a function f : {0, 1}n → {0, 1} the tester makes O(n log(n)/ε) adaptive queries to the function. The tester always accepts a unate function, and rejects with probability at least 0.9 if a function is ε-far from being unate.
متن کاملA $\widetilde{O}(n)$ Non-Adaptive Tester for Unateness
Khot and Shinkar (RANDOM, 2016) recently describe an adaptive, O(n log(n)/ε)-query tester for unateness of Boolean functions f : {0, 1}n 7→ {0, 1}. In this note, we describe a simple non-adaptive, O(n log(n/ε)/ε) -query tester for unateness for real-valued functions over the hypercube.
متن کاملA Õ(n) Non-Adaptive Tester for Unateness
Khot and Shinkar (RANDOM, 2016) recently describe an adaptive, O(n log(n)/ε)-query tester for unateness of Boolean functions f : {0, 1} 7→ {0, 1}. In this note, we describe a simple non-adaptive, O(n log(n/ε)/ε) -query tester for unateness for real-valued functions over the hypercube.
متن کاملTesting Unateness of Real-Valued Functions
We give a unateness tester for functions of the form f : [n] → R, where n, d ∈ N and R ⊆ R with query complexity O( log(max(d,n)) ). Previously known unateness testers work only for Boolean functions over the domain {0, 1}. We show that every unateness tester for realvalued functions over hypergrid has query complexity Ω(min{d, |R|}). Consequently, our tester is nearly optimal for real-valued f...
متن کاملOptimal Unateness Testers for Real-Valued Functions: Adaptivity Helps
We study the problem of testing unateness of functions f : {0, 1}d → R.We give aO( ε ·log d ε )query nonadaptive tester and a O( ε )-query adaptive tester and show that both testers are optimal for a fixed distance parameter ε. Previously known unateness testers worked only for Boolean functions, and their query complexity had worse dependence on the dimension both for the adaptive and the nona...
متن کامل